Dynamic Structured Grid Hierarchy Partitioners Using Inverse Space-Filling Curves
نویسنده
چکیده
This paper discusses partitioning of dynamic structured grid hierarchies, occuring in structured adaptive mesh re nement (SAMR) applications. When a SAMR method is executed on a parallel computer, the work load will change dynamically. Thus, there is need for dynamic load balancing. Inverse spacelling curve partitioning (ISP) is appealing for load balancing in parallel SAMR, because of its speed. In this paper, ISP is considered as part of a partitioning approach, which combines structured and unstructured techniques. More precisely, various design decisions for the structured partitioning are considered. Di erent design choices lead to graphs with di erent properties. The main objective is to investigate how these di erences a ect the behavior of ISP. The paper contributes by (a) identifying certain design choices as being advantageous, and (b) presenting four new partitioning algorithms that correspond to these design decisions.
منابع مشابه
Dynamic Octree Load Balancing Using Space-Filling Curves
The Zoltan dynamic load balancing library provides applications with a reusable object oriented interface to several load balancing techniques, including coordinate bisection, octree/space filling curve methods, and multilevel graph partitioners. We describe enhancements to Zoltan’s octree load balancing procedure and its distributed structures that improve performance of the space filling curv...
متن کاملDynamic Load Balancing Using Space-Filling Curves
Space-filling curves (SFCs) provide a continuous mapping from a one-dimensional to a d-dimensional space and have been used to linearize spatially distributed data for partitioning, memory management and image processing. This paper gives a short introduction to the concept of SFCs and highlights some of the applications found in computer science. The main focus will be on dynamic distribution ...
متن کاملParallel domain decomposition and load balancing using space-filling curves
Partitioning techniques based on space-filling curves have received much recent attention due to their low running time and good load balance characteristics. The basic idea underlying these methods is to order the multidimensional data according to a space-filling curve and partition the resulting onedimensional order. However, space-filling curves are defined for points that lie on a uniform ...
متن کاملMemory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves
We will present an approach to numerical simulation on recursively structured adaptive discretisation grids. The respective grid generation process is based on recursive bisection of triangles along marked edges. The resulting refinement tree is sequentialised according to a Sierpinski space-filling curve, which leads to both minimal memory requirements and inherently cache-efficient processing...
متن کاملAn Evaluation of Partitioners for Parallel SAMR Applications
This paper presents an experimental evaluation of a suite of dynamic partitioning/load-balancing techniques for adaptive grid hierarchies that underlie parallel structured adaptive mesh re nement applications. Partitioners evaluated include those included in popular software libraries such as GrACE, Vampire, and ParMetis. The overall goal of the research presented in the paper is an application...
متن کامل